门架式溜尾系统及应用

本文介绍了配合复式门架起重设备进行联合吊装的门架式溜尾系统结构组成及应用方式。该系统由中央控制室远程控制配合复式门架起重设备协同吊装须直立安装的装置或构件,具备起吊、下放、爬行能力,同时拥有辅助纠偏及拽尾缆风装置,可有效配合主门架起重设备进行吊装作业。     

Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem

The multi-objective flexible job shop scheduling problem is solved using a novel path-relinking algorithm based on the state-of-the-art Tabu search algorithm with back-jump tracking. A routing solution is identified by problem-specific neighborhood search, and is then further refined by the Tabu search algorithm with back-jump tracking for a sequencing decision. The resultant solution is used to maintain the medium-term memory where the best solutions are stored. A path-relinking heuristics is designed to generate diverse solutions in the most promising areas. An improved version of the algorithm is then developed by incorporating an effective dimension-oriented intensification search to find solutions that are located near extreme solutions. The proposed algorithms are tested on benchmark instances and its experimental performance is compared with that of algorithms in the literature. Comparison results show that the proposed algorithms are competitive in terms of its computation performance and solution quality.     

Conformational Study of the Structure of dibenzo-18-crown-6. Comparison with 18-crown-6

We report for the first time the conformational analysis of dibenzo-18-crown-6, db18c6. The conformational search was carried out using the CONFLEX conformational search method of cyclic molecules. Energies were calculated for the low-lying predicted conformations at different levels of theory up to the G3MP2 level. At the G3MP2 level, the predicted ground state (GS) conformation was more stable than the experimental conformation by only 1.60 kcal/mol. Strong similarity was found between the GS structure and experimental conformations of db18c6 and 18-crown-6, 18c6. The GS and experimental conformations of db18c6 are non-planar. This allows db18c6 to exist in optically active enantiomers. Similar to 18c6, it was concluded that the db18c6 structure is stabilized by intramolecular hydrogen bond. We also performed the computations for the water and chloroform solution phase, where the same conformation was predicted as the GS conformation.     

Succession of hide–seek and pursuit–evasion at heterogeneous locations

Many interactions between searching agents and their elusive targets are composed of a succession of steps, whether in the context of immune systems, predation or counterterrorism. In the simplest case, a two-step process starts with a search-and-hide phase, also called a hide-and-seek phase, followed by a round of pursuit–escape. Our aim is to link these two processes, usually analysed separately and with different models, in a single game theory context. We define a matrix game in which a searcher looks at a fixed number of discrete locations only once each searching for a hider, which can escape with varying probabilities according to its location. The value of the game is the overall probability of capture after k looks. The optimal search and hide strategies are described. If a searcher looks only once into any of the locations, an optimal hider chooses it''s hiding place so as to make all locations equally attractive. This optimal strategy remains true as long as the number of looks is below an easily calculated threshold; however, above this threshold, the optimal position for the hider is where it has the highest probability of escaping once spotted.     

Mixing and Simplex Search for Optimal Illumination in Machine Vision

Mixed-color illumination affects the quality of images in industrial vision system and it is important to optimize color and intensity for image acquisition. This study used simplex search to find the optimal illumination in a short amount of time. A typical color mixer synthesized various color of lights by changing the inputs of RGB power LEDs and passing the lights through an optical system. The image quality under mixed-color illumination was calculated according to the sharpness. For the purpose of optimal illumination using simplex search, a probe network was organized with N + 1probing points for N inputs. The shape of the probe network, simplex, was varied through procedures of extension, contraction, and shrinkage. The inputs of the color mixer were changed until the size of the simplex became smaller than a threshold. The simplex search was tested for commercial semiconductor patterns, and was useful for finding the optimal illumination.     

Breakout local search for the multi-objective gate allocation problem

The problem of assigning gates to arriving and departing flights is one of the most important problems in airport operations. We take into account the real multi-criteria nature of the problem by optimizing a total of nine gate allocation objectives that are oriented both on convenience for airport/airline services and passenger comfort. As far as we are aware, this is the largest number of objectives jointly optimized in the GAP literature. Given the complexity of the considered problem, we propose a heuristic approach based on the Breakout Local Search (BLS) framework. BLS is a recent variant of the Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce an appropriate degree of diversification by determining adaptively the number and type of moves for the next perturbation phase. Moreover, we use a new memory-based greedy constructive heuristic to generate a starting point for BLS. Benchmark instances used for our experiments and comparisons are based on information provided by Manchester Airport.     

Students' online interactive patterns in augmented reality-based inquiry activities

Inquiry learning has been developing for years and many countries have incorporated inquiry learning into the scope of K-12 education. Educators have indicated the importance of engaging students in knowledge-sharing activities during the inquiry learning process. In this study, a location-based augmented reality (AR) environment with a five-step guiding mechanism is developed to guide students to share knowledge in inquiry learning activities. To evaluate the effectiveness of the proposed approach in terms of promoting the knowledge sharing behaviors of students, an experiment has been conducted in an elementary school natural science course. The participants were 57 fourth-grade students from an elementary school in Northern Taiwan, divided into an experimental group of 28 students who learned with the AR-based approach and a control group of 29 students who learned with the conventional in-class mobile learning approach. The students' learning behaviors, including their movements in the real-world environment and interactions with peers, were recorded. Accordingly, the learning patterns and interactions of the two groups were analyzed via lag-sequential analysis and quantitative content analysis. It was found that, in comparison with the conventional inquiry-based mobile learning activity, the AR-based inquiry learning activity is able to engage the students in more interactions for knowledge construction. The findings of this study provide guidance for helping teachers develop effective strategies and learning designs for conducting inquiry-based learning activities.     

Gender difference in web search perceptions and behavior: Does it vary by task performance?

This study investigates Chinese students' gender differences in their actual use of the web for online information seeking. One hundred and seven Chinese university students responded to questionnaires regarding their perceptions about the use of the web for learning purposes. Afterwards, all the participants were asked to search online to answer two questions about bees' decision for hive location. As they searched, the online system logged participants' search activities during the search, including the type of activities during search, the frequency of each activity and the time spent on each activity. Participants were compared by gender in terms of their web search efficacy, web search anxiety, frequency counts of different web search activities, time spent on each search activity and search task performance. Web search efficacy levels varied by gender but not by performance levels. Anxiety did not vary by gender or performance levels. The interaction effect between gender and performance level was found in several search process variables: significant gender differences were only found in medium-performing students wherein males were engaged in more search activities than females, as seen in the larger number of searches, search queries, and times male students updated the search queries. One factor that could explain the significant gender differences in the medium-level group was their web search efficacy. The more confident medium-performing male students were in web search, the less need they perceived to access information to solve the task. This pattern was reversed for medium-performing females. The high- and low-performing males did not differ much from females in their search activities. It appeared that students' perceptions of their web search ability did not contribute much to their search activities in these two groups. Implications of the findings were also discussed.     

NLP-based faceted search: Experience in the development of a science and technology search engine

An appropriate promotion, distribution and dissemination of scientific, artistic and technology developments can foster the collaboration between a country’s productive and academic sectors. The purpose of this paper is to present a novel search engine aiming at helping people to access science and technology advances, researchers and institutions working in specific areas of research. Our search engine first collects information disseminated on the Web in academic institution sites and in researchers personal homepages. Then, after intensive text processing, it summarizes the information in an enriched and user-friendly presentation oriented to non-expert users. Stable performance and an acceptable level of effectiveness for automatic named entities recognition indicate the potential of our approach for bridging the gap between the heterogeneous and unstructured information available on the Web about the research and development advances in a country and the innovation required by the productive sectors.     

Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search

In this study, we investigate the problem of maximum frequent time-window selection (MFTWS) that appears in the process of discovering association rules time-windows (ARTW). We formulate the problem as a mathematical model using integer programming that is a typical combination problem with a solution space exponentially related to the problem size. A variable neighbourhood search (VNS) algorithm is developed to solve the problem with near-optimal solutions. Computational experiments are performed to test the VNS algorithm against a benchmark problem set. The results show that the VNS algorithm is an effective approach for solving the MTFWS problem, capable of discovering many large-one frequent itemset with time-windows (FITW) with a larger time-coverage rate than the lower bounds, thus laying a good foundation for mining ARTW.